On Graph Partitioning, Spectral Analysis, and Digital Mesh Processing
نویسنده
چکیده
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We also elaborate on the connection between graph partitioning and spectral graph theory. Applications in computer graphics are described.
منابع مشابه
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. A new domain mapping algorithm is presented that extends recent work in which ideas from spectral graph theory have been applied to this problem. The generalization of spectral graph bisection involves a novel use of mul...
متن کاملPartitioning of Two-dimensional Nurbs Meshes for the Parallel Isogeometric Analysis
Isogeometric analysis is a quickly emerging alternative to the standard, polynomialbased finite element analysis. It is only the question of time, when it will be implemented into major software packages and will be intensively used by engineering community to the analysis of complex realistic problems. Computational demands of such analyses, that may likely exceed the capacity of a single comp...
متن کاملHeuristics for Domain Decomposition
The domain decomposition method embodies large potentials for a parallelization of FEM methods. In this data-parallel approach, the domain of interest is partitioned into smaller subdomains, either before the mesh generation or afterwards (mesh partitioning). The subdomains are assigned to processors that calculate the corresponding part of the approximation. The mesh decomposition and assignme...
متن کاملSpectral Methods for Mesh Processing and Analysis
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out desired tasks. Early works in this area can be traced back to the seminal paper by Taubin in 1995, where spectral analysis of mesh geometry based on a combinatorial Laplacian aids our understanding of the low-pass filte...
متن کاملUser-controllable mesh segmentation using shape harmonic signature
Due to different shape modeling applications, partitioning a given complex 3D mesh model into some patches or meaningful subparts is one of the fundamental problems in digital geometry processing. By using the high-dimensional mean-shift clustering scheme in shape signature space, a new method is proposed which can generate user-specified segmentation results automatically for different applica...
متن کامل